Three Puzzles on Mathematics, Computation, and Games

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Puzzles on Mathematics, Computation, and Games

In this lecture I will talk about three mathematical puzzles involving mathematics and computation that have preoccupied me over the years. The first puzzle is to understand the amazing success of the simplex algorithm for linear programming. The second puzzle is about errors made when votes are counted during elections. The third puzzle is: are quantum computers possible?

متن کامل

Games, puzzles, and computation

There is a fundamental connection between the notions of game and of computation. At its most basic level, this is implied by any game complexity result, but the connection is deeper than this. One example is the concept of alternating nondeterminism, which is intimately connected with two-player games. In the first half of this thesis, I develop the idea of game as computation to a greater deg...

متن کامل

Teaching mathematics with games and puzzles

and complete graph analogues of the Evans conjecture. [6] John Goldwasser and William Klostermeyer. Maximization versions of " lights out " games in grids and graphs.

متن کامل

Two Puzzles About Computation

Turing’s classical analysis of computation [13] gives a compelling account of the nature of the computational process; of how we compute. This allows the notion of computability, of what can in principle be computed, to be captured in a mathematically precise fashion. The purpose of this note is to raise two different questions, which are rarely if ever considered, and to which, it seems, we la...

متن کامل

The Computational Complexity of Games and Puzzles

The subject of my thesis is studying the algorithmic properties of one and two-player games people enjoy playing, such as chess or Sudoku. This research falls into a wider area known as combinatorial game theory. One of the main questions asked about games in this context is whether they are algorithmically tractable, that is, whether they can be solved with efficient algorithms. So far, more t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notices of the American Mathematical Society

سال: 2018

ISSN: 0002-9920,1088-9477

DOI: 10.1090/noti1696